منابع مشابه
Atom Mapping of Chemical of Chemical Reactions via Constraint Programming
A chemical reaction is a process of transforming one set of molecules (educts) into another set (products). In the course of a reaction, chemical bonds which hold the atoms together are redistributed, so that each atom in a reaction educt appears in a specific position of a reaction product. Tracing atoms between educts and products refers to a non-trivial problem in computational chemistry and...
متن کاملpreventive maintenance scheduling with integer programming and constraint programming
preventive maintenance scheduling is to perform a series of tasks that prevents or minimizes production breakdowns and improves the reliability. mathematical models have been developed to solve the preventive maintenance scheduling problem. there are several limitations in the prior work in this area of research. craft combinations are assumed to be given. the craft combination problem concerns...
متن کاملConstraint Programming with Multisets
We propose extending constraint solvers with multiset variables. That is, variables whose values are multisets. Such an extension can help prevent introducing unnecessary symmetry into a model. We identify a number of different representations for multiset variables, and suggest primitive and global constraints on multiset variables. Surprisingly, unlike finite domain variables, decomposition o...
متن کاملDeconfliction With Constraint Programming
Current European Air Traffic Control (ATC) system is far exceeded by the demand and the resulting delays are a financial and psychological burden for airlines and passengers. One of their main sources is the hourly capacity constraints, defined on each en-route ATC sector, but poorly representing the workload of controllers. Whereas previous works were mainly focused on optimizing the ground de...
متن کاملSolving Constraint Satisfaction Puzzles with Constraint Programming
Constraint Programming (CP) is a powerful paradigm for solving Combinatorial Problems (generally issued from Decision Making). In CP, Enumeration Strategies are crucial for resolution performances. In this work, we model the known benchmark problems Latin Square, Magic Square and Sudoku as a Constraint Satisfaction Problems. We solve them with Constraint Programming comparing the performance of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms for Molecular Biology
سال: 2014
ISSN: 1748-7188
DOI: 10.1186/s13015-014-0023-3